Average-Case Performance of Rollout Algorithms for Knapsack Problems: Supplementary Material
نویسندگان
چکیده
The asymptotic result then follows. ∗Corresponding author. Department of Electrical Engineering and Computer Science, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139; [email protected] †Department of Electrical Engineering and Computer Science , Laboratory for Information and Decision Systems, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA 02139; [email protected]
منابع مشابه
Average-Case Performance of Rollout Algorithms for Knapsack Problems
Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. Interpreted as an approximate dynamic programming algorithm, a rollout algorithm estimates the value-to-go at each decision stage by simulating future events while following a heuristic policy, referred to as the base policy. While in many cases rollout algorithms are guarantee...
متن کاملAnalysis of approximation and uncertainty in optimization
We study a series of topics involving approximation algorithms and the presence of uncertain data in optimization. On the first theme of approximation, we derive performance bounds for rollout algorithms. Interpreted as an approximate dynamic programming algorithm, a rollout algorithm estimates the value-to-go at each decision stage by simulating future events while following a heuristic policy...
متن کاملA rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
Rollout algorithms have enjoyed success across a variety of domains as heuristic solution procedures for stochastic dynamic programs (SDPs). However, because most rollout implementations are closely tied to specific problems, the visibility of advances in rollout methods is limited, thereby making it difficult for researchers in other fields to extract general procedures and apply them to diffe...
متن کاملWorst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
We present on O(n log n) greedy algorithm with a worst-case performance ratio > 4 for the unbounded knapsack problem, an O(n log n) greedy algorithm with a worst-case performance ratio of ~ for the subset-sum problem, and an O(n log n) greedy algorithm with a worst-case performance ratio of ~for the partition problem. These greedy algorithms, in the sense of worst-case performance, are better t...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کامل